A Proposal for Quantum Rational Secret Sharing
نویسندگان
چکیده
A rational secret sharing scheme is a game in which each party responsible for reconstructing a secret tries to maximize his utility by obtaining the secret alone. Quantum secret sharing schemes, either derived from quantum teleportation or from quantum error correcting code, do not succeed when we assume rational participants. This is because all existing quantum secret sharing schemes consider that the secret is reconstructed by a party chosen by the dealer. In this paper, for the first time, we propose a quantum secret sharing scheme which is resistant to rational parties. The proposed scheme is fair (everyone gets the secret), correct and achieves strict Nash equilibrium.
منابع مشابه
On the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کاملStrongly Secure Quantum Ramp Secret Sharing Constructed from Algebraic Curves over Finite Fields (full version arXiv:1410.5126)
Secret sharing (SS) scheme encodes a secret into multiple shares being distributed to participants, so that only qualified sets of shares can reconstruct the secret perfectly [13]. The secret and shares are traditionally classical information [13], but now quantum secret and quantum shares can also be used [3, 4, 11]. In perfect SS, if a set of shares is not qualified, that is, it cannot recons...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملRational Secret Sharing & Game Theory
Consider m out of n secret sharing protocol among n players where each player is rational. In 2004, J.Halpern and V.Teague first pointed out problem for any Rational Secret Sharing protocol from completely game theoretic point of view and then proposed a randomized protocol to solve that problem. Later in 2006, S. Dov Gordon and J. Katz extended the idea proposed by J.Halpern and V.Teague and i...
متن کاملSocio-Rational Secret Sharing as a New Direction in Rational Cryptography
Rational secret sharing was proposed by Halpern and Teague in [12]. The authors show that, in a setting with rational players, secret sharing and multiparty computation are only possible if the actual secret reconstruction round remains unknown to the players. All the subsequent works use a similar approach with different assumptions. We change the direction by bridging cryptography, game theor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1501.04212 شماره
صفحات -
تاریخ انتشار 2015